package com.sxkiler.demo.medium;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import java.util.*;
import com.sxkiler.demo.model.*;

/**
smallest-subsequence-of-distinct-characters=不同字符的最小子序列
<p>返回字符串 <code>text</code>&nbsp;中按字典序排列最小的子序列，该子序列包含&nbsp;<code>text</code>&nbsp;中所有不同字符一次。</p>

<p>&nbsp;</p>

<p><strong>示例 1：</strong></p>

<pre><strong>输入：</strong>"cdadabcc"
<strong>输出：</strong>"adbc"
</pre>

<p><strong>示例 2：</strong></p>

<pre><strong>输入：</strong>"abcd"
<strong>输出：</strong>"abcd"
</pre>

<p><strong>示例 3：</strong></p>

<pre><strong>输入：</strong>"ecbacba"
<strong>输出：</strong>"eacb"
</pre>

<p><strong>示例 4：</strong></p>

<pre><strong>输入：</strong>"leetcode"
<strong>输出：</strong>"letcod"
</pre>

<p>&nbsp;</p>

<p><strong>提示：</strong></p>

<ol>
	<li><code>1 &lt;= text.length &lt;= 1000</code></li>
	<li><code>text</code>&nbsp;由小写英文字母组成</li>
</ol>

<p>&nbsp;</p>

<p><strong>注意：</strong>本题目与 316 <a href="https://leetcode-cn.com/problems/remove-duplicate-letters/">https://leetcode-cn.com/problems/remove-duplicate-letters/</a> 相同</p>

 */
public class smallestSubsequence {
    

    class Solution {
        public String smallestSubsequence(String param0) {
            return null;
        }
    }

    @Test
    public void test(){
        Solution solution = new Solution();
        /**
        "bcabc"
        */
        //int [] num1 = new int[]{1,3};
        //int [] num2 = new int[]{2};
        //Assertions.assertEquals(solution.{{questionName}}(num1,num2),2);
    }
}

